MATRIX FACTORIZATION OF MULTIVARIATE BERNSTEIN POLYNOMIALS

Multivariate Bernstein polynomials and convexity

It is well known that in two or more variables Bernstein polynomi-als do not preserve convexity. Here we introduce two variations, one stronger than the classical notion, the other one weaker, which are preserved. Moreover, a weaker suucient condition for the monotony of subsequent Bernstein polynomials is given. linearly independent, in the course of which d has to be greater than or equal to ...

K-functionals and multivariate Bernstein polynomials

This paper estimates upper and lower bounds for the approximation rates of iterated Boolean sums of multivariate Bernstein polynomials. Both direct and inverse inequalities for the approximation rate are established in terms of a certain K -functional. From these estimates, one can also determine the class of functions yielding optimal approximations to the iterated Boolean sums. c © 2008 Elsev...

Numerical factorization of multivariate complex polynomials

One can consider the problem of factoring multivariate complex polynomials as a special case of the decomposition of a pure dimensional solution set of a polynomial system into irreducible components. The importance and nature of this problem however justify a special treatment. We exploit the reduction to the univariate root finding problem as a way to sample the polynomial more efficiently, c...

Factorization of multivariate positive Laurent polynomials

Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix Féjer-Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. F...

A companion matrix resultant for Bernstein polynomials